Recursive pseudo-well-orderings
نویسندگان
چکیده
منابع مشابه
Well-foundedness of Term Orderings
Well-foundedness is the essential property of orderings for proving termination. We introduce a simple criterion on term orderings such that any term ordering possessing the subterm property and satisfying this criterion is well-founded. The usual path orders fulfil this criterion, yielding a much simpler proof of well-foundedness than the classical proof depending on Kruskal's theorem. Even mo...
متن کاملRecursive Path Orderings Can Also Be Incremental
In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingredients not only a precedence but also an underlying ordering =B. It can be used for incremental (innermost) termination proofs of hierarchical unions by defining =B as an extension of the termination proof obtained fo...
متن کاملOn the Complexity of Recursive Path Orderings
Well-founded orderings on terms are useful in a variety of contexts in computer science, not only in simply proving the termination of equationally defined algorithms, but also in automated deduction, for example in restrictions of paramodulation [2,6] and in rewriting systems (for an excellent survey on orderings and their use in rewriting see [4]). In these settings, decision procedures for v...
متن کاملRecursive Path Orderings Can Be Context-Sensitive
Context-sensitive rewriting (CSR) is a simple restriction of rewriting which can be used e.g. for modelling non-eager evaluation in programming languages. Many times termination is a crucial property for program veriication. Hence, developing tools for automatically proving termination of CSR is necessary. All known methods for proving termination of (CSR) systems are based on transforming the ...
متن کاملParamodulation with Well-founded Orderings
For many years, all existing completeness results for KnuthBendix completion and ordered paramodulation required the term ordering ≻ to be well-founded, monotonic and total(izable) on ground terms. Then, it was shown that well-foundedness and the subterm property were enough for ensuring completeness of ordered paramodulation. Here we show that the subterm property is not necessary either. By u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1968
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1968-0244049-7